a(x1) → x1
a(a(b(x1))) → b(b(a(a(x1))))
c(b(x1)) → c(a(x1))
↳ QTRS
↳ DependencyPairsProof
a(x1) → x1
a(a(b(x1))) → b(b(a(a(x1))))
c(b(x1)) → c(a(x1))
C(b(x1)) → A(x1)
A(a(b(x1))) → A(x1)
C(b(x1)) → C(a(x1))
A(a(b(x1))) → A(a(x1))
a(x1) → x1
a(a(b(x1))) → b(b(a(a(x1))))
c(b(x1)) → c(a(x1))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
C(b(x1)) → A(x1)
A(a(b(x1))) → A(x1)
C(b(x1)) → C(a(x1))
A(a(b(x1))) → A(a(x1))
a(x1) → x1
a(a(b(x1))) → b(b(a(a(x1))))
c(b(x1)) → c(a(x1))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDPOrderProof
↳ QDP
A(a(b(x1))) → A(x1)
A(a(b(x1))) → A(a(x1))
a(x1) → x1
a(a(b(x1))) → b(b(a(a(x1))))
c(b(x1)) → c(a(x1))
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
A(a(b(x1))) → A(x1)
Used ordering: Polynomial interpretation [25,35]:
A(a(b(x1))) → A(a(x1))
The value of delta used in the strict ordering is 3/16.
POL(a(x1)) = 3/4 + x_1
POL(A(x1)) = (1/4)x_1
POL(b(x1)) = x_1
a(x1) → x1
a(a(b(x1))) → b(b(a(a(x1))))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ QDPOrderProof
↳ QDP
A(a(b(x1))) → A(a(x1))
a(x1) → x1
a(a(b(x1))) → b(b(a(a(x1))))
c(b(x1)) → c(a(x1))
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
A(a(b(x1))) → A(a(x1))
The value of delta used in the strict ordering is 16.
POL(a(x1)) = 4 + (2)x_1
POL(A(x1)) = (2)x_1
POL(b(x1)) = 4 + x_1
a(x1) → x1
a(a(b(x1))) → b(b(a(a(x1))))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ PisEmptyProof
↳ QDP
a(x1) → x1
a(a(b(x1))) → b(b(a(a(x1))))
c(b(x1)) → c(a(x1))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
C(b(x1)) → C(a(x1))
a(x1) → x1
a(a(b(x1))) → b(b(a(a(x1))))
c(b(x1)) → c(a(x1))